Behavioral Mereology: A Modal Logic for Passing Constraints

Modal Logic and Distributed Message Passing Automata

In a recent article, Lauri Hella and co-authors identify a canonical connection between modal logic and deterministic distributed constant-time algorithms. The paper reports a variety of highly natural logical characterizations of classes of distributed message passing automata that run in constant time. The article leaves open the question of identifying related logical characterizations when ...

Subtype Constraints in Modal Logic

We establish a new relationship between subtype constraints and modal logic. It implies uniformly that satisfiability of structural subtype constraints with ordered constants, function and recursive types is DEXPTIME-complete, and PSPACE-complete without recursive types. This answers an open question raised by Tiuryn and Wand in 1993, and yields a new simpler proof to a result of Tiuryn and Fre...

Path Constraints from a Modal Logic Point of View

We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding them in Propositional Dynamic Logic. While some of our decidability results were known before, we believe that our improved complexity bounds are new. Our proofs, based on techniques from modal logic, shed additional ...

Project Report A Temporal Logic for Modeling Constraints on Software Architecture Evolution 15-816 Modal Logic

My research involves developing models and tools to support architecture-level planning of large software evolutions. Over the past couple of years, we have developed a theoretical framework that we think encapsulates the most important issues in these kinds of evolutions, as well as formal models and tool prototypes within this framework. One important component of our framework involves the f...

A Modal Logic for KLAIM